Structured Analysis Approaches for Large Markov

نویسنده

  • Peter Buchholz
چکیده

The tutorial introduces structured analysis approaches for continuous time Markov chains (CTMCs) which are a means to extend the size of analyzable state spaces signiicantly compared with conventional techniques. It is shown how generator matrices of large CTMCs can be represented in a very compact form, how this representation can be exploited in numerical solution techniques and how numerical analysis proots from this exploitation. Additionally, recent results covering implementation issues, tool support, and advanced analysis techniques are surveyed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Input-Output Hidden Markov Models for trees

The paper introduces an input-driven generative model for tree-structured data that extends the bottom-up hidden tree Markov model with non-homogenous transition and emission probabilities. The advantage of introducing an input-driven dynamics in structured-data processing is experimentally investigated. The results of this preliminary analysis suggest that input-driven models can capture more ...

متن کامل

An MCMC Approach to Solving Hybrid Factored MDPs

Hybrid approximate linear programming (HALP) has recently emerged as a promising framework for solving large factored Markov decision processes (MDPs) with discrete and continuous state and action variables. Our work addresses its major computational bottleneck – constraint satisfaction in large structured domains of discrete and continuous variables. We analyze this problem and propose a novel...

متن کامل

Dynamic Bayesian Networks as Formal Abstractions of Structured Stochastic Processes

We study the problem of finite-horizon probabilistic invariance for discrete-time Markov processes over general (uncountable) state spaces. We compute discrete-time, finite-state Markov chains as formal abstractions of general Markov processes. Our abstraction differs from existing approaches in two ways. First, we exploit the structure of the underlying Markov process to compute the abstractio...

متن کامل

A Fast Method for Property Prediction in Graph-Structured Data from Positive and Unlabelled Examples

The analysis of large and complex networks, or graphs, is becoming increasingly important in many scientific areas including machine learning, social network analysis and bioinformatics. One natural type of question that can be asked in network analysis is “Given two sets R and T of individuals in a graph with complete and missing knowledge, respectively, about a property of interest, which ind...

متن کامل

Comparison of Probabilistic and Stochastic Formulations in Modeling Growth Uncertainty and Variability

We compare two approaches for inclusion of uncertainty/variability in modeling growth in size-structured population models. One entails imposing a probabilistic structure on growth rates in the population while the other involves formulating growth as a stochastic Markov diffusion process. We present a theoretical analysis that allows one to include comparable levels of uncertainty in the two d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996